Optimal per-edge processing times in the semi-streaming model
نویسندگان
چکیده
منابع مشابه
Optimal Per-Edge Processing Times in the Semi-Streaming Model
We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks. The semi-streaming model, which is appropriate when dealing with massive graphs, forbids random access to the input and restricts the memory to O(n · polylogn) bits. Particularly, the formerly best per-edge proces...
متن کاملStreaming algorithm for graph spanners - single pass and constant processing time per edge
A spanner is a sparse subgraph of a given graph that preserves approximate distance between each pair of vertices. In precise words, a t-spanner of a graph G = (V,E), for any t ∈ N, is a subgraph (V,ES), ES ⊆ E such that, for any u, v ∈ V , their distance in the subgraph is at most t times their distance in the original graph. The parameter t is called the stretch associated with the t-spanner....
متن کاملk-Connectivity in the Semi-Streaming Model
We present the first semi-streaming algorithms to determine k-connectivity of an undirected graph with k being any constant. The semi-streaming model for graph algorithms was introduced by Muthukrishnan in 2003 and turns out to be useful when dealing with massive graphs streamed in from an external storage device. Our two semi-streaming algorithms each compute a sparse subgraph of an input grap...
متن کاملGraph Sparsification in the Semi-streaming Model
Analyzing massive data sets has been one of the key motivations for studying streaming algorithms. In recent years, there has been significant progress in analysing distributions in a streaming setting, but the progress on graph problems has been limited. A main reason for this has been the existence of linear space lower bounds for even simple problems such as determining the connectedness of ...
متن کاملThe semi-streaming model for graph problems
This report presents a relatively new approach in modelling graph problems, called the semi-streaming model. Many of the current computational problems that people face involve huge graphs that cannot be stored in memory. This model is suitable for such type of problems. The main idea is to traverse the set of edges in constant or logarithmic (in the terms of n, the number of vertices) number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2007
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.06.004